Probabilistic Addressing to Support Mobility in Wireless Networks
نویسندگان
چکیده
We propose Mobile Probabilistic ADdressing (MPAD), a virtual-coordinates-based routing protocol for Wireless Mesh Networks (WMNs). In contrast to other virtual coordinates based protocols such as Beacon Vector Routing (BVR), our approach collects statistical distributions of hop distances, thereby avoiding explicit link estimation. MPAD therefore captures topology changes arising from link variability and mobility more gracefully. We implemented our prototype for wireless mesh nodes and the OMNeT++ simulator, and evaluated it on a real testbed and in simulation. In the simulation we evaluated three different mobility scenarios. From the results that we obtained, we can conclude that MPAD is a feasible routing protocol for WMNs.
منابع مشابه
LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملProbabilistic location-free addressing in wireless networks
Multi-hop wireless networks, such as sensor, ad hoc and mesh networks, suffer from permanent topology dynamics due to unstable wireless links and node mobility. Stable addressing, as needed for reliable routing, in such evolving, challenging network conditions is thus a difficult task. Efficient multihop wireless communication in these networks then requires a fully decentralized, scalable rout...
متن کاملEnergy Efficient Routing in Mobile Ad Hoc Networks by Using Honey Bee Mating Optimization
Mobile Ad hoc networks (MANETs) are composed of mobile stations communicating through wireless links, without any fixed backbone support. In these networks, limited power energy supply, and frequent topology changes caused by node mobility, makes their routing a challenging problem. TORA is one of the routing protocols that successfully copes with the nodes’ mobility side effects, but it do...
متن کاملEnergy Efficient Routing in Mobile Ad Hoc Networks by Using Honey Bee Mating Optimization
Mobile Ad hoc networks (MANETs) are composed of mobile stations communicating through wireless links, without any fixed backbone support. In these networks, limited power energy supply, and frequent topology changes caused by node mobility, makes their routing a challenging problem. TORA is one of the routing protocols that successfully copes with the nodes’ mobility side effects, but it do...
متن کاملRule-based joint fuzzy and probabilistic networks
One of the important challenges in Graphical models is the problem of dealing with the uncertainties in the problem. Among graphical networks, fuzzy cognitive map is only capable of modeling fuzzy uncertainty and the Bayesian network is only capable of modeling probabilistic uncertainty. In many real issues, we are faced with both fuzzy and probabilistic uncertainties. In these cases, the propo...
متن کامل